Using Ant Colony Optimization Metaheuristic in Forest Transportation Planning
نویسندگان
چکیده
Timber transportation is one of the most expensive activities in forest operations. Traditionally, the goal of forest transportation planning has been to find the combination of road development and harvest equipment placement that minimizes total harvesting and transportation costs. However, modern transportation problems are not driven only by economics of timber management, but also by multiple uses of roads and their social and ecological impacts. These social and environmental considerations and requirements introduce side constraints into the forest transportation planning, making the problems larger and more complex. We developed a new problem solving technique using the ant colony optimization (ACO) metaheuristic, which is able to solve large and complex transportation planning problems with side constraints. We considered the environmental impact of forest road networks represented by sediment yields as side constraints. Results on a hypothetical transportation problem show that this algorithm (ACO-FTPP) is promising for solving real forest transportation planning problems with side constraints. A description of the development of the algorithm and its search process is presented.
منابع مشابه
Bio-Inspired Meta-Heuristics for Emergency Transportation Problems
Emergency transportation plays a vital role in the success of disaster rescue and relief operations, but its planning and scheduling often involve complex objectives and search spaces. In this paper, we conduct a survey of recent advances in bio-inspired meta-heuristics, including genetic algorithms (GA), particle swarm optimization (PSO), ant colony optimization (ACO), etc., for solving emerge...
متن کاملACO-Based Neighborhoods for Fixed-charge Capacitated Multi-commodity Network Design Problem
The fixed-charge Capacitated Multi-commodity Network Design (CMND) is a well-known problem of both practical and theoretical significance. Network design models represent a wide variety of planning and operation management issues in transportation telecommunication, logistics, production and distribution. In this paper, Ant Colony Optimization (ACO) based neighborhoods are proposed for CMND pro...
متن کاملA multilevel ACO approach for solving forest transportation planning problems with environmental constraints
This paper presents a multilevel ant colony optimization (MLACO) approach to solve constrained forest transportation planning problems (CFTPPs). A graph coarsening technique is used to coarsen a network representing the problem into a set of increasingly coarser level problems. Then, a customized ant colony optimization (ACO) algorithm is designed to solve the CFTPP from coarser to finer level ...
متن کاملApplying ant colony optimization metaheuristic to solve forest transportation planning problems with side constraints
Forest transportation planning problems (FTPP) have evolved from considering only the financial aspects of timber management to more holistic problems that also consider the environmental impacts of roads. These additional requirements have introduced side constraints, making FTPP larger and more complex. Mixed-integer programming (MIP) has been used to solve FTPP, but its application has been ...
متن کاملImplementation of Travelling Salesman Problem Using ant Colony Optimization
Within the Artificial Intelligence community, there is great need for fast and accurate traversal algorithms, specifically those that find a path from a start to goal with minimum cost. Cost can be distance, time, money, energy, etc. Travelling salesman problem (TSP) is a combinatorial optimization problem. TSP is the most intensively studied problem in the area of optimization. Ant colony opti...
متن کامل